81![Fast Binary Translation: Translation Efficiency and Runtime Efficiency Mathias Payer Department of Computer Science ETH Zurich Abstract—Fast binary translation is a key component for Fast Binary Translation: Translation Efficiency and Runtime Efficiency Mathias Payer Department of Computer Science ETH Zurich Abstract—Fast binary translation is a key component for](https://www.pdfsearch.io/img/60f9deb60aa4ce7c3cc9aeb8b2d82db9.jpg) | Add to Reading ListSource URL: www.nebelwelt.netLanguage: English - Date: 2016-04-13 09:07:44
|
---|
82![VIDEO-DRIVEN ANIMATION OF HUMAN BODY SCANS Edilson de Aguiar, Rhaleb Zayer, Christian Theobalt, Marcus Magnor and Hans-Peter Seidel MPI Informatik, Saarbr¨ucken, Germany ABSTRACT We present a versatile, fast and simple VIDEO-DRIVEN ANIMATION OF HUMAN BODY SCANS Edilson de Aguiar, Rhaleb Zayer, Christian Theobalt, Marcus Magnor and Hans-Peter Seidel MPI Informatik, Saarbr¨ucken, Germany ABSTRACT We present a versatile, fast and simple](https://www.pdfsearch.io/img/4e74708648a10ffe12fe4cddc02e0bdd.jpg) | Add to Reading ListSource URL: people.mpi-inf.mpg.deLanguage: English - Date: 2007-03-18 07:26:53
|
---|
83![FAST INVERSE SQUARE ROOT CHRIS LOMONT Abstract. Computing reciprocal square roots is necessary in many applications, such as vector normalization in video games. Often, some loss of precision is acceptable for a large in FAST INVERSE SQUARE ROOT CHRIS LOMONT Abstract. Computing reciprocal square roots is necessary in many applications, such as vector normalization in video games. Often, some loss of precision is acceptable for a large in](https://www.pdfsearch.io/img/11e3b9a96a8e21d59b49a3dc373448f8.jpg) | Add to Reading ListSource URL: www.matrix67.comLanguage: English - Date: 2007-11-24 06:47:36
|
---|
84![FLINT 1.6: Fast Library for Number Theory William B. Hart and Andy Novocin and previously David Harvey December 24, 2010 Contents FLINT 1.6: Fast Library for Number Theory William B. Hart and Andy Novocin and previously David Harvey December 24, 2010 Contents](https://www.pdfsearch.io/img/8a7e0835dccfc96ba34913a108a01785.jpg) | Add to Reading ListSource URL: www.flintlib.orgLanguage: English - Date: 2014-12-31 19:00:00
|
---|
85![Fast recursive coding based on grouping of Symbols Nikolay Ponomarenko, Vladimir Lukin, Karen Egiazarian, Jaakko Astola Abstract — A novel fast recursive coding technique is proposed. It operates with only integer valu Fast recursive coding based on grouping of Symbols Nikolay Ponomarenko, Vladimir Lukin, Karen Egiazarian, Jaakko Astola Abstract — A novel fast recursive coding technique is proposed. It operates with only integer valu](https://www.pdfsearch.io/img/4d81bc8958641699bfcb9572933834d9.jpg) | Add to Reading ListSource URL: www.ponomarenko.infoLanguage: English - Date: 2010-02-21 03:05:44
|
---|
86![Finite-Dimensional Lie Algebras for Fast Diffeomorphic Image Registration Miaomiao Zhang and P. Thomas Fletcher Scientific Computing and Imaging Institute, University of Utah, Salt Lake City, UT Abstract. This paper pre Finite-Dimensional Lie Algebras for Fast Diffeomorphic Image Registration Miaomiao Zhang and P. Thomas Fletcher Scientific Computing and Imaging Institute, University of Utah, Salt Lake City, UT Abstract. This paper pre](https://www.pdfsearch.io/img/cf70a2596042c127f164f1a9ea0bce3b.jpg) | Add to Reading ListSource URL: www.sci.utah.eduLanguage: English - Date: 2015-04-06 18:52:52
|
---|
87![A Provably Secure Elliptic Curve Scheme with Fast Encryption David Galindo1 , Sebasti` a Mart´ın1 , Tsuyoshi Takagi2 and Jorge L. Villar1 1 A Provably Secure Elliptic Curve Scheme with Fast Encryption David Galindo1 , Sebasti` a Mart´ın1 , Tsuyoshi Takagi2 and Jorge L. Villar1 1](https://www.pdfsearch.io/img/1aa5452329374254ab80d7da29855b40.jpg) | Add to Reading ListSource URL: www.dgalindo.esLanguage: English - Date: 2007-11-26 10:35:53
|
---|
88![PAINLESS RECONSTRUCTION FROM MAGNITUDES OF FRAME COEFFICIENTS RADU BALAN, BERNHARD G. BODMANN, PETER G. CASAZZA AND DAN EDIDIN Abstract. The primary goal of this paper is to develop fast algorithms for PAINLESS RECONSTRUCTION FROM MAGNITUDES OF FRAME COEFFICIENTS RADU BALAN, BERNHARD G. BODMANN, PETER G. CASAZZA AND DAN EDIDIN Abstract. The primary goal of this paper is to develop fast algorithms for](https://www.pdfsearch.io/img/2ba6190f282a28eecfe296eb77bd12ef.jpg) | Add to Reading ListSource URL: www.math.umd.eduLanguage: English - Date: 2007-08-04 11:04:01
|
---|
89![LU-CS-TR:LUNFD6/(NFCS–)], Dept of Computer Science, Lund University, Sweden FASTER SUFFIX SORTING N. JESPER LARSSON∗ AND KUNIHIKO SADAKANE† Abstract. We propose a fast and memory efficient a LU-CS-TR:LUNFD6/(NFCS–)], Dept of Computer Science, Lund University, Sweden FASTER SUFFIX SORTING N. JESPER LARSSON∗ AND KUNIHIKO SADAKANE† Abstract. We propose a fast and memory efficient a](https://www.pdfsearch.io/img/a18bf8a23d253f96024b19c646a6a68d.jpg) | Add to Reading ListSource URL: www.larsson.dogma.netLanguage: English - Date: 2003-04-20 16:57:05
|
---|